Flipping to robustly delete a vertex in a delaunay tetrahedralizationLEDOUX, Hugo; GOLD, Christopher M; BACIU, George et al.Lecture notes in computer science. 2005, pp 737-747, issn 0302-9743, isbn 3-540-25860-4, 4Vol, 11 p.Conference Paper

On the average length of Delaunay triangulationsCHANG, R. C; LEE, R. C. T.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 3, pp 269-273, issn 0006-3835Article

A procedure for automatically correcting invalid flat triangles occuring in triangulated contour dataWARE, J. M.Computers & geosciences. 1998, Vol 24, Num 2, pp 141-150, issn 0098-3004Article

Assessing geometric algorithms : some comments arising from the paper fast topological construction of Delaunay triangulations and Voronoi diagrams by Victor J.D. TsaiTIPPER, J.C.Computers & geosciences. 1995, Vol 21, Num 3, pp 433-436, issn 0098-3004Article

An implementation of Watson's algorithm for computing 2-dimensional Delaunay triangulationsSLOAN, S. W; HOULSBY, G. T.Advances in engineering software (1978). 1984, Vol 6, Num 4, pp 192-197, issn 0141-1195Article

Géométrie algorithmique = Computational geometryBERSTEL, J; POCCHIOLA, M.Le Courrier du C.N.R.S. 1993, Num 80, pp 58-59, issn 0153-985XArticle

A NOTE ON LEE AND SCHACHTER'S ALGORITHM FOR DELAUNAY TRIANGULATIONSHAPIRO M.1981; INT. J. COMPUTER INF. SCI.; ISSN 0091-7036; USA; DA. 1981; VOL. 10; NO 6; PP. 413-418; BIBL. 3 REF.Article

Modified DAG location for Delaunay triangulationKOLINGEROVA, Ivana.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 3, 125-134Conference Paper

Evaluation of a Delaunay-based method for surface approximationPER-OLOF FJÄLLSTRÖM.Computer-aided design. 1993, Vol 25, Num 11, pp 711-719, issn 0010-4485Article

Relative neighborhood graphs in the L₁-metricLEE, D. T.Pattern recognition. 1985, Vol 18, Num 5, pp 327-332, issn 0031-3203Article

Delaunay-admissibilité des triangulations de surfaces = Delaunay-conformity of surface triangulationsPEBAY, P. P; FREY, P. J.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 327, Num 3, pp 313-318, issn 0764-4442Article

Approximations of set skeletonsPOPOV, A. T.SPIE proceedings series. 1998, pp 184-191, isbn 0-8194-2909-0Conference Paper

Geometry-based fully automatic mesh generation and the Delaunay triangulationSCHROEDER, W. J; SHEPHARD, M. S.International journal for numerical methods in engineering. 1988, Vol 26, Num 11, pp 2503-2515, issn 0029-5981Article

TWO ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATIONLEE DT; SCHACHTER BJ.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 3; PP. 219-242; BIBL. 37 REF.Article

NEITHER THE GREEDY NOR THE DELAUNAY TRIANGULATION OF A PLANAR POINT SET APPROXIMATES THE OPTIMAL TRIANGULATIONMANACHER GK; ZOBRIST AL.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 31-34; BIBL. 8 REF.Article

A fingerprint matching using minutiae triangulationPARZIALE, Giuseppe; NIEL, Albert.Lecture notes in computer science. 2004, pp 241-248, issn 0302-9743, isbn 3-540-22146-8, 8 p.Conference Paper

Image dense matching based on Delauney triangulationSHEN, P; WANG, W; WU, C et al.SPIE proceedings series. 1998, pp 109-116, isbn 0-8194-2912-0Conference Paper

Génération de maillages de simplexes pour la modélisation d'objets naturels = Simplicial mesh generation for natural object modellingConraud, Joel; Hallet, Jean-Laurent.1997, 152 p.Thesis

Compression d'images par fractales basée sur la triangulation de Delaunay = Fractal image compression based on Delaunay triangulationDavoine, Franck; Chassery, J.-M.1995, 210 p.Thesis

Graphe de connexion et triangulation de Delaunay = Connexion graph and Delaunay triangulationBorouchaki, Houman; Norguet, François.1993, 140 p.Thesis

Including known discoutinuities directly into a triangular irregular mesh for automatic contouring purposesBUYS, J; MESSERSCHMIDT, H.J; BOTHA, J.F et al.Computers & geosciences. 1991, Vol 17, Num 7, pp 875-881, issn 0098-3004Article

A space efficient greedy triangulation algorithmGOLDMAN, S. A.Information processing letters. 1989, Vol 31, Num 4, pp 191-196, issn 0020-0190Article

A geometric solution to the largest-free-sphere problem in zeolite frameworksFOSTER, M. D; RIVIN, I; TREACY, M. M. J et al.Microporous and mesoporous materials. 2006, Vol 90, Num 1-3, pp 32-38, issn 1387-1811, 7 p.Article

Efficient Computation of Elliptic Gabriel GraphLEE, Changhee; KIM, Donguk; SHIN, Hayong et al.Lecture notes in computer science. 2006, pp 440-448, issn 0302-9743, isbn 3-540-34070-X, 9 p.Conference Paper

High accuracy difference schemes on unstructured triangle gridsPOPOV, Igor; POLYAKOV, Sergey; KARAMZIN, Yuri et al.Lecture notes in computer science. 2003, pp 555-562, issn 0302-9743, isbn 3-540-00608-7, 8 p.Conference Paper